Systems and methods for predicting compressibility of data

ABSTRACT

Systems and methods for predicting the compressibility of data in a flash storage device are provided. One such method involves extracting byte intervals from the block of data, each of the byte intervals consisting of a preselected number of bytes, performing a hash function to map the byte intervals into a plurality of bins, the plurality of bins comprising one bin for each possible value of the byte intervals, incrementing a hit count each time more than one of the byte intervals is mapped into a single bin of the plurality of bins, and determining whether to compress the block of data based on a comparison of a ratio of the hit count to a total number of the byte intervals and a preselected threshold. This method may be implemented in hardware to ensure fast and efficient execution.

FIELD

Aspects of the disclosure relate generally to data compression, and morespecifically, to systems and methods for predicting the compressibilityof data in a flash storage device.

BACKGROUND

Flash storage devices are increasing used for storing data in electronicapplications. Flash storage devices involve a nonvolatile memory inwhich data may be electrically erased and programmed often in datablocks of a selected size. Real time lossless compression is widely usedin data storage systems, and specifically in flash storage, because ithelps to reduce resource usage. For example, in a write flow for a flashstorage device, adding compression may provide a number of advantages.These advantages can include a reduction in the total number of writes,thereby enabling a higher effective over provisioning and reducing writeamplification. These advantages can also include enabling a largercapacity drive using elastic storage and reduction of power duringwrites due to reduced writes to the flash storage.

On the other hand, the data storage speed may be decreased substantiallybecause compression processes can consume large amounts of resources.The compression processes often involve substantial and intensivecalculations, which correspond to significant consumption of power andtime. However, many data blocks may have limited compressibility. Morespecifically, the resources consumed to compress these data blocks maynot be worth expending because little storage space will be saved. Incases when the data is effectively non-compressible, the power and timeexpended are largely wasted. Thus, a method that can predict acompressibility of data blocks, so the storage system can know whetherit would be efficient to compress a given data block and possibly avoidcompressing data blocks having low compressibility, might savesubstantial amounts of resources (e.g., power and latency). Saving theseresources can improve the storage system performance.

Some data compressibility prediction algorithms exist based primarily onsoftware implementations. However, for real time storage systems such asflash storage, the compressibility prediction by software may beunrealistic because it is too slow. Also, there are some implementationsinvolving both software and hardware. Such solutions may be faster thansoftware implemented algorithms but they are generally still not fastenough for real time storage systems such as flash storage. In addition,these implementations can be overly complicated.

SUMMARY

In one embodiment, the disclosure relates to an algorithm for predictinga compressibility of a block of data. In such case, the algorithm canlook for repeats of byte intervals in a compression history bufferstoring data from the data block. The algorithm can use a count of therepeats of the byte intervals as a score to predict the compressibilityof the data in the history buffer, which may, for example, be taken froma data block of a flash storage device. In several embodiments, thisalgorithm may be implemented primarily or exclusively in hardware toensure fast and efficient execution.

In another embodiment, the disclosure relates to a method for predictinga compressibility of a block of data including extracting byte intervalsfrom the block of data, each of the byte intervals consisting of apreselected number of bytes, performing a hash function to map the byteintervals into a plurality of bins, the plurality of bins comprising onebin for each possible value of the byte intervals, incrementing a hitcount each time more than one of the byte intervals is mapped into asingle bin of the plurality of bins, and determining whether to compressthe block of data based on a comparison of a ratio of the hit count to atotal number of the byte intervals and a preselected threshold.

In another embodiment, the disclosure relates to a system for predictinga compressibility of a block of data including an extractor configuredto extract byte intervals from the block of data, each of the byteintervals consisting of a preselected number of bytes, a hash configuredto map the byte intervals into a plurality of bins, the plurality ofbins comprising one bin for each possible value of the byte intervals, acounter configured to increment a hit count each time more than one ofthe byte intervals is mapped into a single bin of the plurality of bins,a compression determiner configured to determine whether to compress theblock of data based on a comparison of a ratio of the hit count to atotal number of the byte intervals and a preselected threshold.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of a flash storage device including acontroller configured to predict a compressibility of a block of data inaccordance with one embodiment of the disclosure.

FIG. 2 is a block diagram of a system for predicting a compressibilityof a block of data in accordance with one embodiment of the disclosure.

FIG. 3 is a table illustrating exemplary simulation results for a systemfor predicting a compressibility of various test blocks of data inaccordance with one embodiment of the disclosure.

FIG. 4 is a flowchart of a process for predicting a compressibility of ablock of data in accordance with one embodiment of the disclosure.

FIG. 5 is a table illustrating exemplary test results for a process forpredicting a compressibility of various test blocks of data inaccordance with one embodiment of the disclosure.

DETAILED DESCRIPTION

Referring now to the drawings, embodiments of systems and methods forpredicting a compressibility of a block of data are illustrated. Onesuch system can include a number of components. An extractor can extractbyte intervals from a block of data (e.g., a block of data from a flashstorage), where each of the byte intervals consists of a preselectednumber of bytes. A hash can map the byte intervals into bins, where thebins include one bin for each possible value of the byte intervals. Acounter can increment a hit count each time more than one of the byteintervals is mapped into a single bin of the bins. A compressiondeterminer can determine whether to compress the block of data based ona comparison of a ratio of the hit count to a total number of the byteintervals and a preselected threshold. If the ratio is greater than thepreselected threshold, the data block can be compressed. If not, thedata block can be left un-compressed, while saving the power and timeassociated with trying to compress a data block without a capability tobe substantially compressed. In a number of embodiments, the system isimplemented in hardware in a very efficient manner that helps to ensurefast operation. For example, in one embodiment, the hash can map thebyte intervals using less than the full number of bits contained in anyone of the byte intervals. In one embodiment, the byte intervals are twobytes long. In one embodiment, a method for predicting a compressibilityof a block of data can include performing the actions described abovefor the extractor, the hash, the counter, and the compressiondeterminer. In a number of embodiments, the systems and methods forpredicting a compressibility of a block of data can save power and timeotherwise associated with compressing blocks having low compressibility.

FIG. 1 is a block diagram of a flash storage device including acontroller configured to predict a compressibility of a block of data inaccordance with one embodiment of the disclosure. The flash storage 100includes a host 102 and a flash storage device 104 coupled to the host102. The host 102 provides commands to the flash storage device 104 fortransferring data between the host 102 and the flash storage device 104.For example, the host 102 may provide a write command to the flashstorage device 104 for writing data to the flash storage device 104 orread command to the flash storage device 104 for reading data from theflash storage device 104. The host 102 may be any system or devicehaving a need for data storage or retrieval and a compatible interfacefor communicating with the flash storage device 104. For example, thehost 102 may a computing device, a personal computer, a portablecomputer, or workstation, a server, a personal digital assistant, adigital camera, a digital phone, or the like.

The flash storage device 104 includes a host interface 106, a controller108, a memory 110, and a flash storage 112. The host interface 106 iscoupled to the controller 108 and facilitates communication between thehost 102 and the controller 108. Additionally, the controller 108 iscoupled to the memory 110 and the flash storage 112. The host interface106 may be any type of communication interface, such as an IntegratedDrive Electronics (IDE) interface, a Universal Serial Bus (USB)interface, a Serial Peripheral (SP) interface, an Advanced TechnologyAttachment (ATA) interface, a Small Computer System Interface (SCSI), anIEEE 1394 (Firewire) interface, or the like. In some embodiments, thehost 102 includes the flash storage device 104. In other embodiments,the flash storage device 104 is remote with respect to the host 102 oris contained in a remote computing system coupled in communication withthe host 102. For example, the host 102 may communicate with the flashstorage device 104 through a wireless communication link.

The controller 108 controls operation of the flash storage device 104.In various embodiments, the controller 108 receives commands from thehost 102 through the host interface 106 and performs the commands totransfer data between the host 102 and the flash storage 112. Thecontroller 108 may include any type of processing device, such as amicroprocessor, a microcontroller, an embedded controller, a logiccircuit, software, firmware, or the like, for controlling operation ofthe flash storage device 104.

Additionally, the controller 108 can be configured to extract byteintervals from a block of data (e.g., a block of data from a flashstorage), where each of the byte intervals consists of a preselectednumber of bytes (e.g., two bytes), perform a hash function to map thebyte intervals into a plurality of bins, where the plurality of binsinclude one bin for each possible value of the byte intervals, incrementa hit count each time more than one of the byte intervals is mapped intoa single bin of the plurality of bins, and determine whether to compressthe block of data based on a comparison of a ratio of the hit count to atotal number of the byte intervals and a preselected threshold. Thesefunctions will be described in more detail below.

In some embodiments, some or all of the functions described herein asbeing performed by the controller 108 may instead be performed byanother element of the flash storage device 104. For example, the flashstorage device 104 may include a microprocessor, a microcontroller, anembedded controller, a logic circuit, software, firmware, or any kind ofprocessing device, for performing one or more of the functions describedherein as being performed by the controller 108. In some embodiments,one or more of the functions described herein as being performed by thecontroller 108 are instead performed by the host 102. In someembodiments, some or all of the functions described herein as beingperformed by the controller 108 may instead be performed by anotherelement such as a controller in a hybrid drive including both flashstorage elements and magnetic storage elements.

The memory 110 may be any memory, computing device, or system capable ofstoring data. For example, the memory 110 may be a random-access memory(RAM), a dynamic random-access memory (DRAM), a static random-accessmemory (SRAM), a synchronous dynamic random-access memory (SDRAM), aflash storage, an erasable programmable read-only-memory (EPROM), anelectrically erasable programmable read-only-memory (EEPROM), or thelike. In various embodiments, the controller 108 uses the memory 110, ora portion thereof, to store data during the transfer of data between thehost 102 and the flash storage 112. For example, the memory 110 or aportion of the memory 110 may be a cache memory.

The flash storage 112 receives data from the controller 108 and storesthe data. The flash storage 112 may be any type of flash storage, suchas a flash storage system, a solid-state drive, a flash memory card, asecure digital (SD) card, a universal serial bus (USB) memory device, aCompactFlash card, a SmartMedia device, a flash storage array, or thelike.

While not bound by any particular theory it is noted that a number ofcompression algorithms have been proposed. As for these proposedcompression algorithms, such as Huffman coding, arithmetic coding,Lempel-Ziv (LZ), and Lempel-Ziv-Welch (LZW), they often have a commontheme. That is, these algorithms are often, or nearly always, lookingfor duplicate occurrences of data in a data block. A data block can beefficiently compressed when there are some duplicate data or datasequences in the block. This disclosure describes one or more algorithmsthat are based on this observation. For a data block, if the number ofrepeated data pairs is big enough, it can be considered highlycompressible. In one example, the number of repeated data pairs may becalculated as follows. Suppose, for example, there is a data blockconsisting of the values {1, 2, 3, 4, 5, 6, 2, 5, 6, 2, 2, 2, 7, 7, 7,7, 3, 4, 7, 7}. If it is divided into pairs, the data block becomes{1,2},{3,4},{5,6}, {2, 5}, {6, 2}, {2, 2}, {7, 7}, {7, 7},{3,4}, {7, 7},with a total of 10 data pairs. Data pairs {7, 7}, {7, 7}, {7,7} are thesame. After the first {7,7} data pair, the {7,7} value is repeated twicein the data block. Thus, the number of repeated {7,7} data pairs is 2.Also, data pair {3,4} repeats once. As a result, the total number ofrepeated data pairs in this data block is 3. There are 3 repeated datapairs out of 10 data pairs. It can be concluded that the compressibilityof this block is low. Aspects of this simple example will be explored infurther detail below.

FIG. 2 is a block diagram of a system 200 for predicting acompressibility of a block of data in accordance with one embodiment ofthe disclosure. In some embodiments, the system 200 can be implementedwith the controller 108 of FIG. 1. The system 200 (e.g., which may alsobe referred to as an entropy detector) includes a two byte extractor 202coupled to a first hash 204, which is coupled to a second hash 206 and athird hash 208. Each of the hashes (204, 206, 208) is coupled to arecord register 210 which is coupled to a hit counter 212.

In operation, the two byte extractor 202 can extract data in two byteintervals from a stream of data (e.g., 128 bytes at a time) from a blockof data (e.g., a 4 k block of data from a flash storage such as 112 inFIG. 1). One or more of the three hashes (204, 206, 208) can receive thetwo bytes intervals of data (e.g., data pair) and map them into one binof the record register 210. In the illustrated embodiment, the hashescan map only 11 of the 16 bits of the two byte interval. While not boundby any particular theory, it has been discovered that the entropydetection algorithms described herein can be sufficiently accurate inpredicting compressibility of a data block while considering only aportion (e.g., 11 bits) of the two byte intervals.

The record register 210 can have a single bin for each possible value ofthe two byte intervals. Since the hashes are only mapping 11 bits of the16 bit data pairs, the record register 210 can have as few as 2^11 binsor 2048 bins. The record register 210 can be initialized such that allbins are contain zeros. Whenever a data pair is first mapped into a bin,the bin register can be set to one.

The hit counter 212 can monitor the record register 210 and increment ahit count each time more than one of the two byte intervals (e.g., datapairs) is mapped into a single bin. That is, if a particular binregister in the record register 210 has been set to one (e.g., because aparticular data pair was first encountered) and the hash (204, 206, 208)maps the same data pair to the same bin register at a subsequent time,then the counter 212 increments the hit count. The counter 212 canincrement the hit count when this same sequence occurs at any of the2048 bins of the record register 210. The hit counter 212 canefficiently be as small as an eleven bit counter.

In the embodiment illustrated in FIG. 2, the byte extractor 202 extractsbyte intervals of two bytes from a data stream (e.g., 128 bytes at atime). In other embodiments, the byte extractor 202 can extract morethan or less than 2 bytes of data at a time and the data stream can bemore than or less than 128 bytes at a time. Similarly, while the hashes(204, 206, 208) in FIG. 2 use 11 bits of the two byte data pairs to mapinto the bins of the record register 210, they can use more than or lessthan 11 bits in other embodiments. In the embodiment of FIG. 2, therecord register 210 has 2048 bins. In other embodiments, record register210 can have more than or less than 2048 bins in accordance with aspectsof an efficient implementation of the entropy detector. In theembodiment of FIG. 2, the hit counter 212 is an 11 bit counter. In otherembodiments, hit counter 212 can have more than or less than 11 bits inaccordance with aspects of an efficient implementation of the entropydetector. For example, in several embodiments, the hashes (204, 206,208), record register 210 and hit counter 212 can have just enough bitsto support the possible combinations of the number of bytes selected forthe byte intervals at the extractor 202. Effectively, the implementationof the entropy detector 200 can be optimized to reduce implementationarea (e.g., area for hardware/circuitry in a integrated circuit) and thepower consumed.

As to the design of the hardware implementation of the entropy detector200 in FIG. 2, it is noted that a 4 k data block size was chosen for theexample. So the 4 k data block has 2 k data pairs. The data width is 8bits. For the 8 bit data pairs, the possible number of data pairs wouldbe 256 multiplied by 256 or 65536 possible pairs. So the design can havea 64 k 1 bit register file (e.g., bins of the record register 210) torecord if one pair already exists in the block. Similarly, the designcan have an 11 bit counter because the maximum number of repeated datapairs could be to 2 k−1. The counter (e.g., hit counter 212) can be zeroat initial time. Similarly, the 64 k record register 210 can be madezero during initialization. When a data pair first comes out, theentropy detector 200 can write its related record register (e.g., bin)to ‘1’. When this data pair shows up again, the hardware (e.g., entropydetector 200) knows this because its record register is ‘1’. Add 1 tothe counter (e.g., at the hit counter 212) because a repeated data pairis found. While this paragraph discusses some particular values andsizes of various hardware components, these components can have othersuitable values for counting repeated data intervals and therebypredicting the compressibility of a data block. For example, it has beendetermined that the hashes can map only a portion of the 16 bits (e.g.,11 bits) to the record register and still obtain accurate compressionpredictions. In such case, the bit size of the other components, such asthe record register and hit counter, may be reduced accordingly.

In this context, the controller 108 of FIG. 1 and entropy detector 200of FIG. 2 can refer to any machine or selection of logic that is capableof executing a sequence of instructions and should be taken to include,but not limited to, general purpose microprocessors, special purposemicroprocessors, central processing units (CPUs), digital signalprocessors (DSPs), application specific integrated circuits (ASICs),signal processors, microcontrollers, and other suitable circuitry.Further, it should be appreciated that the term processor,microprocessor, circuitry, controller, and other such terms, refer toany type of logic or circuitry capable of executing logic, commands,instructions, software, firmware, functionality, or other suchinformation.

The system 200 of FIG. 2 can represent an efficient hardwareimplementation of a method for predicting a compressibility of a blockof data. The hardware implementation is efficient in that only theminimum sized components (e.g., in terms of number of bits), and in somecases less than the minimum sized components such as in the case of thehashes, are used. As a result of this efficient hardware implementation,and possibly other similar hardware implementations, the speed ofoperation for the system 200 is much faster than any known softwareimplemented solutions for data compressibility prediction. For example,the speed of operation for the system 200 can be on the order ofnanoseconds, while the speed of operation for such software implementedsolutions can be on the order of milliseconds. Thus, the hardwareimplemented system 200 can be up to 1000 times faster than comparativesoftware implemented solutions. In other embodiments, the hardwareimplemented system 200 can be just 10 or 100 times faster than thecomparative software implemented solutions.

To validate design of the entropy detector 200 of FIG. 2 and the generalalgorithm, it has been tested with some high compressibility standardcompression files and also some low compressibility files to compare theresults. These results are illustrated in FIG. 3.

FIG. 3 is a table illustrating exemplary simulation results for a systemfor predicting a compressibility of various test blocks of data inaccordance with one embodiment of the disclosure. Column headings at thetop of the table illustrate the names of various files (e.g., datablocks) that were tested. Row heading at the left side of the tableinclude the original file size, the compressed size followingcompression, the rate/degree of compression, and the algorithm/processratio (“repeated data pairs ratio”) for the percentage of repeated datapairs found based on the 10-16 bits considered. It should be noted thatthe compression ratio may be defined as the uncompressed size divided bythe compressed size. Also, the repeated data pairs ratio may be definedas the number of repeated data pairs divided by the number of total datapairs.

Considering the table data for highly compressible files, whosecompression rates are higher than 2 (see for example, data in columnsheaded by filenames include “alice29.txt”, “asyoulik.txt”, or “sum” inFIG. 3), the repeated data pairs ratios are all above 70%. For thesefiles (e.g., data blocks) having higher compression ratios, the tableillustrates corresponding higher repeated data pairs ratios for thosefiles. For low compressible files (see for example, data in columnsheaded by filenames include “pdf1.pdf” and “XL1.xls” in FIG. 3), theirrepeated data pairs ratios are under 20%.

For a hardware implementation of the algorithm (e.g., see entropydetector 200 of FIG. 2), it has been observed that the algorithm cancompare only part of the data and thereby have lower hardware costs withroughly the same functionality. For example, for an 8 bit data pair,which has a total of 16 bits, the test results of FIG. 3 show that thealgorithm/entropy detector can compare only 15 bits of the 16 bits andthe results of the repeated data pairs ratio are not changedsignificantly. In such case, the hardware implementation may only need64 k divided by 2 or 32 k registers (e.g., for the record register 210)and still can get accurate results for judging whether a given file(e.g., data block) is highly compressible or not. Also, adding arandomizer (e.g., scrambler) can make the results more reliable (e.g.,by randomizing the input data, statistical results are more accurate andreliable). In the simulation of FIG. 3, the table shows results from useof a full 16 as compares with use of less bits (e.g., down to 10 bits).From the table results, this simulation shows that it is possible tocompare 11 bits of the data and still ensure a correctjudgment/prediction of compressibility of the data block. In oneembodiment, a 50% repeated data pairs ratios can be used as a thresholdto identify whether a given file/data block is highly compressible ornot. As shown in FIG. 2, the design may only need 2 k record registersfor implementation. In some synthesis results for the algorithm andimplementation of FIG. 2, the power cost of executing the algorithm isrelatively small.

So the systems and algorithms described herein can be used to save powerby avoiding the compression of low compressibility data blocks. As anexample of the potential power savings, consider a system (e.g.,predictor) implemented in hardware with 28 nanometer (nm) technology atroughly 800 megahertz (MHz) has about 10 milliwatts (mW) powerconsumption. A compression operation with these same hardware parameterswill consume about 1 to 1.5 Watts (W). As a result, the system/predictorwill provide a power savings of at least 1 W minus 10 mW or 990 mW.

FIG. 4 is a flowchart of a process for predicting a compressibility of ablock of data in accordance with one embodiment of the disclosure. Inspecific embodiments, the process may be performed by the entropydetector 200 of FIG. 2, the controller 108 of FIG. 1, or other circuitry(e.g., circuitry residing along the data path in a flash storage deviceor circuitry for performing data compression). In block 402, the processextracts byte intervals from the block of data, each of the byteintervals consisting of a preselected number of bytes. In oneembodiment, the preselected number of bytes is two bytes. In theembodiment of FIG. 2, the extractor 202 can perform this function.

In block 404, the process performs a hash function to map the byteintervals into a plurality of bins, the plurality of bins including onebin for each possible value of the byte intervals. In severalembodiments, the plurality of bins includes one bin, or at least onebin, for each possible value of the byte intervals. In one embodiment,the hashes (204, 206, 208) of FIG. 2 can perform this function. In oneembodiment, the process can use less than the total number of bits inthe preselected number of bytes of the byte intervals in performing thehash function to map the byte intervals.

In block, 406, the process increments a hit count each time more thanone of the byte intervals is mapped into a single bin of the pluralityof bins. In one embodiment, the hit counter 212 of FIG. 2 can performthis function.

In block 408, the process determines whether to compress the block ofdata based on a comparison of a ratio of the hit count (e.g., a totalhit count) to a total number of the byte intervals and a preselectedthreshold. If the ratio is greater than the preselected threshold, theprocess can compress the data block. In several embodiments, the processcan use one or more of the data compression techniques known in the art(e.g., Lempel-Ziv-Welch (LZW) compression, Snappy compression, and thelike). On the other hand, if the ratio is less than the preselectedthreshold, the process can choose not to compress the data block. In oneembodiment, the preselected threshold is 50%. In another embodiment, thepreselected threshold is 45%. In other embodiments, the preselectedthreshold can have other suitable threshold values.

In a number of embodiments, the process first initializes the hit countto zero and all of the bins to zero.

In one embodiment, the process can perform the sequence of actions in adifferent order. In another embodiment, the process can skip one or moreof the actions. In other embodiments, one or more of the actions areperformed simultaneously. In some embodiments, additional actions can beperformed.

To validate this proposed process/algorithm, it has been tested withsome high and low compressibility standard compression files withcertain thresholds. The results are illustrated in FIG. 5.

FIG. 5 is a table illustrating exemplary test results for a process forpredicting a compressibility of various test blocks of data inaccordance with one embodiment of the disclosure. Column heading at thetop of the table illustrate the names of various files (e.g., datablocks) that were tested. Row headings at the left side of the tableinclude the original file size, the compressed size followingcompression, the rate/degree of compression, the algorithm/process ratio(“16-11 random”) for the percentage of repeated data pairs found, a 45%threshold for whether to compress, and a 50% threshold for whether tocompress. The results show that the compression prediction algorithm(e.g., the one implemented in FIG. 2 with 2 byte data intervals) canfairly accurately predict a degree of compressibility of a given file(e.g., data block). The results further show that the results of thecompression prediction algorithm can be compared against a preselectedthreshold to make a sound judgment as to whether a given file/data blockshould be compressed based on a desire to limit the compression of datablocks that have low compressibility (e.g., may only be compressed byless than 45%). It should be noted that the degree of lowcompressibility for data blocks may be changed in accordance withparticular design goals/applications. For example, in one embodiment,the threshold for compressibility can be set lower to save additionalpower. On the other hand, the threshold could be set higher to savestorage space (e.g., in a flash storage device). In several embodiments,the threshold is between 40 and 55 percent, or between about 40 andabout 55 percent.

While the above description contains many specific embodiments of theinvention, these should not be construed as limitations on the scope ofthe invention, but rather as examples of specific embodiments thereof.Accordingly, the scope of the invention should be determined not by theembodiments illustrated, but by the appended claims and theirequivalents.

The various features and processes described above may be usedindependently of one another, or may be combined in various ways. Allpossible combinations and sub-combinations are intended to fall withinthe scope of this disclosure. In addition, certain method, event, stateor process blocks may be omitted in some implementations. The methodsand processes described herein are also not limited to any particularsequence, and the blocks or states relating thereto can be performed inother sequences that are appropriate. For example, described tasks orevents may be performed in an order other than that specificallydisclosed, or multiple may be combined in a single block or state. Theexample tasks or events may be performed in serial, in parallel, or insome other suitable manner. Tasks or events may be added to or removedfrom the disclosed example embodiments. The example systems andcomponents described herein may be configured differently thandescribed. For example, elements may be added to, removed from, orrearranged compared to the disclosed example embodiments.

What is claimed is:
 1. A method for predicting a compressibility of ablock of data, comprising: extracting byte intervals from the block ofdata, each of the byte intervals consisting of a preselected number ofbytes; performing a hash function to map the byte intervals into aplurality of bins, the plurality of bins comprising one bin for eachpossible value of the byte intervals; incrementing a hit count each timemore than one of the byte intervals is mapped into a single bin of theplurality of bins; and determining whether to compress the block of databased on a comparison of a ratio of the hit count to a total number ofthe byte intervals and a preselected threshold, wherein the performingthe hash function to map the byte intervals into the plurality of binscomprises performing the hash function using less than a total number ofbits in the preselected number of bytes.
 2. The method of claim 1,wherein the preselected number of bytes for the byte intervals is twobytes.
 3. The method of claim 1, further comprising: if the ratio of thehit count to the total number of the byte intervals is greater than thepreselected threshold, compressing the data block.
 4. The method ofclaim 1, further comprising: if the ratio of the hit count to the totalnumber of the byte intervals is less than the preselected threshold,determining not to compress the data block.
 5. The method of claim 1,wherein the block of data is a block in a flash storage device.
 6. Themethod of claim 1, wherein the plurality of bins consists of one bin foreach possible value of the byte intervals.
 7. The method of claim 1,wherein the extracting byte intervals from the block of data comprises:setting the plurality of bins to zero; setting the hit count to zero;and extracting byte intervals from the block of data.
 8. The method ofclaim 7: wherein the performing the hash function to map the byteintervals into the plurality of bins comprises: setting, if a currentbin of the plurality of bins mapped to a current byte interval of thebyte intervals is not set to one, the current bin to one; and whereinthe incrementing the hit count each time more than one of the byteintervals is mapped into the single bin of the plurality of binscomprises: incrementing, if the current bin mapped to the current byteinterval is set to one, the hit count.
 9. A system for predicting acompressibility of a block of data, comprising: an extractor configuredto extract byte intervals from the block of data, each of the byteintervals consisting of a preselected number of bytes; a hash configuredto map the byte intervals into a plurality of bins using less than atotal number of bits in the preselected number of bytes, the pluralityof bins comprising one bin for each possible value of the byteintervals; a counter configured to increment a hit count each time morethan one of the byte intervals is mapped into a single bin of theplurality of bins; and a compression determiner configured to determinewhether to compress the block of data based on a comparison of a ratioof the hit count to a total number of the byte intervals and apreselected threshold.
 10. The system of claim 9, wherein thepreselected number of bytes for the byte intervals is two bytes.
 11. Thesystem of claim 9, further comprising: a compressor configured tocompress the data block if the ratio of the hit count to the totalnumber of the byte intervals is greater than the preselected threshold.12. The system of claim 9, further comprising: a compressor configurednot to compress the data block if the ratio of the hit count to thetotal number of the byte intervals is less than the preselectedthreshold.
 13. The system of claim 9, wherein the block of data is ablock in a flash storage device.
 14. The system of claim 9, wherein theplurality of bins consists of one bin for each possible value of thebyte intervals.
 15. The system of claim 9: wherein the plurality of binsis initially set to zero; and wherein the hit count is initially set tozero.
 16. The system of claim 15: wherein the system is configured toset, if a current bin of the plurality of bins mapped to a current byteinterval of the byte intervals is not set to one, the current bin toone; and wherein the counter is configured to increment, if the currentbin mapped to the current byte interval is set to one, the hit count.